On the mean first passage time and mean cover time of a non-backtracking random walk on graphs

The non-backtracking random walk is known to have nicer properties than simple walks. However, the effect of graph structure on has not been fully clarified. In this paper, we elucidate mean first passage time two different types graphs with characteristics as well cover regular graphs. Furthermore, analyze effects using several numerical examples. Our findings include that number nodes in a great impact walk.